Rank distribution of Delsarte codes
نویسندگان
چکیده
In analogy with the Singleton defect for classical codes, we propose a definition of rank defect for Delsarte rank-metric codes. We characterize codes whose rank defect and dual rank defect are both zero, and prove that the rank distribution of such codes is determined by their parameters. This extends a result by Delsarte on the rank distribution of MRD codes. In the general case of codes of positive defect, we show that the rank distribution is determined by the parameters of the code, together the number of codewords of small rank. Moreover, we prove that if the rank defect of a code and its dual are both one, and the dimension satisfies a divisibility condition, then the number of minimum-rank codewords and dual minimum-rank codewords is the same. Finally, we discuss how our results specialize to Gabidulin codes. Introduction Rank-metric codes were first introduced in coding theory by Delsarte in [5]. They are sets of matrices of fixed size, endowed with the rank distance. Rank-metric codes are of interest within network coding, public-key cryptography, and distributed storage, where they stimulated a series of works aimed at better understanding their properties. In this paper, we study the rank distribution of rank-metric codes. We always assume that the codes are linear, and often refer to them as Delsarte codes. The study of the weight distribution of a code is a topic of current interest in coding theory, where several authors have studied the case of linear codes endowed with the Hamming distance. In particular, it is a classical result that the weight distribution of an MDS code is determined by its parameters. The so-called MRD codes are the analogue of MDS codes in the context of Delsarte codes. They were introduced in [5] by Delsarte, who also showed that Part of the work was done while J. de la Cruz was visiting the University of Zurich. The first author thanks Joachim Rosenthal for the invitation. E. Gorla and A. Ravagnani were partially supported by the Swiss National Science Foundation through grant no. 200021 150207 and by the ESF COST Action IC1104. H. López was partially supported by CONACyT and by the Swiss Confederation through the Swiss Government Excellence Scholarship no. 2014.0432. Email addresses: [email protected], [email protected], [email protected], [email protected].
منابع مشابه
Generalized weights: an anticode approach
In this paper we study generalized weights as an algebraic invariant of a code. We first describe anticodes in the Hamming and in the rank metric, proving in particular that optimal anticodes in the rank metric coincide with Frobenius-closed spaces. Then we characterize both generalized Hamming and rank weights of a code in terms of the intersection of the code with optimal anticodes in the res...
متن کاملRank-metric LCD codes
In this paper, we investigate the rank-metric codes which are proposed by Delsarte and Gabidulin to be complementary dual codes. We point out the relationship between Delsarte complementary dual codes and Gabidulin complementary dual codes. In finite field Fmq , we construct two classes of Gabidulin LCD MRD codes by self-dual basis (or almost self-dual basis) of Fmq over Fq. Under a suitable co...
متن کاملMacWilliams Identity for Codes with the Rank Metric
The MacWilliams identity, which relates the weight distribution of a code to the weight distribution of its dual code, is useful in determining the weight distribution of codes. In this paper, we derive the MacWilliams identity for linear codes with the rank metric, and our identity has a different form than that by Delsarte. Using our MacWilliams identity, we also derive related identities for...
متن کاملRank-metric codes and their duality theory
We compare the two duality theories of rank-metric codes proposed by Delsarte and Gabidulin, proving that the former generalizes the latter. We also give an elementary proof of MacWilliams identities for the general case of Delsarte rank-metric codes, in a form that never appeared in the literature. The identities which we derive are very easy to handle, and allow us to re-establish in a very c...
متن کاملProperties of Rank Metric Codes
This paper investigates general properties of codes with the rank metric. First, we investigate asymptotic packing properties of rank metric codes. Then, we study sphere covering properties of rank metric codes, derive bounds on their parameters, and investigate their asymptotic covering properties. Finally, we establish several identities that relate the rank weight distribution of a linear co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1510.01008 شماره
صفحات -
تاریخ انتشار 2015